Majority Model on Random Regular Graphs
نویسندگان
چکیده
Consider a graph G = (V, E) and an initial random coloring where each vertex v ∈ V is blue with probability Pb and red otherwise, independently from all other vertices. In each round, all vertices simultaneously switch their color to the most frequent color in their neighborhood and in case of a tie, a vertex keeps its current color. The main goal of the present paper is to analyze the behavior of this basic and natural process on the random d-regular graph Gn,d. It is shown that for all ǫ > 0, Pb ≤ 1/2 − ǫ results in final complete occupancy by red in O(logd log n) rounds with high probability, provided that d ≥ c/ǫ 2 for a suitable constant c. Furthermore, we show that with high probability, Gn,d is immune; i.e., the smallest dynamic monopoly is of linear size. A dynamic monopoly is a subset of vertices that can “take over” in the sense that a commonly chosen initial color eventually spreads throughout the whole graph, irrespective of the colors of other vertices. This answers an open question of Peleg [21].
منابع مشابه
Convergence, Unanimity and Disagreement in Majority Dynamics on Unimodular Graphs and Random Graphs
In majority dynamics, agents located at the vertices of an undirected simple graph update their binary opinions synchronously by adopting those of the majority of their neighbors. On infinite unimodular transitive graphs (e.g., Cayley graphs), when initial opinions are chosen from a distribution that is invariant with respect to the graph automorphism group, we show that the opinion of each age...
متن کاملStrict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
We study the strict majority bootstrap percolation process on graphs. Vertices may be active or passive. Initially, active vertices are chosen independently with probability p. Each passive vertex v becomes active if at least d deg(v)+1 2 e of its neighbors are active (and thereafter never changes its state). If at the end of the process all vertices become active then we say that the initial s...
متن کاملPhase Transitions in Equilibrium and Non-Equilibrium Models on Some Topologies
On some regular and non-regular topologies, we studied the critical properties of models that present up-down symmetry, like the equilibrium Ising model and the nonequilibrium majority vote model. These are investigated on networks, like Apollonian (AN), Barabási–Albert (BA), small-worlds (SW), Voronoi–Delaunay (VD) and Erdös–Rényi (ER) random graphs. The review here is on phase transitions, cr...
متن کاملYale University Preprint Learning Random Regular Graphs
The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this paper we study the problem of learning random regular graphs from random paths. A random regular graph is generated uniformly at random and in a standard label-guided graph exploration setting, the edges incident from a node in the graph have distinct local labels. T...
متن کاملLearning Random Regular Graphs
The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this paper we study the problem of learning random regular graphs from random paths. A random regular graph is generated uniformly at random and in a standard label-guided graph exploration setting, the edges incident from a node in the graph have distinct local labels. T...
متن کاملThe diameter of random regular graphs
We give asymptotic upper and lower bounds for the diameter of almost every r-regular graph on n vertices (n~). Though random graphs of various types have been investigated extensively over the last twenty years, random regular graphs have hardly been studied. The reason for this is that until recently there was no formula for the asymptotic number of labelled r-regular graphs of order n. Such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.07423 شماره
صفحات -
تاریخ انتشار 2017